A Provably Secure Ring Signature Scheme with Bounded Leakage Resilience
نویسندگان
چکیده
Conventionally, the unforgeability of ring signature schemes is defined in an ideal environment where the attackers cannot access any information about the secret keys of the signers. This assumption is too strong to be satisfied in the real world since the cryptographic operations involves the secret key information leakage in various ways due to power/time consumption difference in operations on the 0/1 bits of the secret key. An attacker can obtain this information both passively by collecting power consumption information or actively by injecting faults during the signing operations. Thus, provably secure ring signature in the conventional security definition may be insecure in the real world due to the key information leakage. To address this problem, we formalize the first bounded leakage resilience definition for ring signature. A leakage resilient ring signature scheme remains secure even if arbitrary, but bounded, information about the secret key is leaked to an adversary. A bound on the leaked information is necessary because a ring signature cannot be secure if some signer’s secret key is fully leaked. Then we propose the first ring signature scheme with bounded leakage resilience. Following the enhanced security definition with leakage resilience, the proposed scheme is provably secure based on the difficulty of the second l-representation problem in finite field.
منابع مشابه
A Leakage-Resilient Pairing-Based Variant of the Schnorr Signature Scheme
Leakage-resilient cryptography aims at capturing side-channel attacks within the provable security framework. Currently there exists a plethora of schemes with provably secure guarantees against a variety of side-channel attacks. However, meeting the strongest security levels (resilience against continual leakage attacks) under the weakest assumptions leads currently to costly schemes. Addition...
متن کاملSignature Schemes with Bounded Leakage Resilience
A leakage-resilient cryptosystem remains secure even if arbitrary, but bounded, information about the secret key (and possibly other internal state information) is leaked to an adversary. Denote the length of the secret key by n. We show: – A full-fledged signature scheme tolerating leakage of ( 1− n− ) · n bits of information about the secret key (for any constant < 1), based on general assump...
متن کاملLeakage-Resilient Signatures
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to “side-channel attacks” which exploit leakage of information about the secret internal state. In this work we put forward the notion of “leakage-resilient signatures,” which strengthens the standard security notion by gi...
متن کاملAn Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation
In view of the expected progress in cryptanalysis it is important to find alternatives for currently used signature schemes such as RSA and ECDSA. The most promising lattice-based signature schemes to replace these schemes are BLISS (CRYPTO 2013) and GLP (CHES 2012). Both come with a security reduction from a lattice problem and have high performance. However, their parameters are not chosen ac...
متن کاملTamper Resilient Cryptography Without Self-Destruct
We initiate a general study of schemes resilient to both tampering and leakage attacks. Tampering attacks are powerful cryptanalytic attacks where an adversary can change the secret state and observes the effect of such changes at the output. Our contributions are outlined below: 1. We propose a general construction showing that any cryptographic primitive where the secret key can be chosen as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014